Reference-point-based branch and bound algorithm for multiobjective optimization

An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound

We propose an interactive reference point approach for multiple objective (mixed) integer linear programming problems that exploits the use of branch-and-bound techniques for solving the scalarizing programs. At each dialogue phase, the decision maker must specify a criterion reference point or just choose an objective function he/she wants to improve in respect to the previous ecient (nondomi...

Optimization methodology based on neural networks and reference point algorithm applied to fuzzy multiobjective optimization problems

Artificial neural networks are massively paralleled distributed computation and fast convergence and can be considered as an efficient method to solve real-time optimization problems. In this paper, we propose reference point based neural network algorithm for solving fuzzy multiobjective optimization problems MOOP. The target is to identify the Pareto-optimal region closest to the reference po...

Constraint Optimization Techniques for MultiObjective Branch and Bound Search

An Ellipsoidal Branch and Bound Algorithm for Global Optimization

A branch and bound algorithm is developed for global optimization. Branching in the algorithm is accomplished by subdividing the feasible set using ellipses. Lower bounds are obtained by replacing the concave part of the objective function by an affine underestimate. A ball approximation algorithm, obtained by generalizing of a scheme of Lin and Han, is used to solve the convex relaxation of th...

A multilevel parallelized branch and bound algorithm for quadratic optimization

General QOPs (quadratic optimization problems) have a linear objective function cTx to be maximized over a nonconvex compact feasible region F described by a finite number of quadratic inequalities. Difficulties in solving a QOP arise from the nonconvexity in its quadratic terms. We propose a branch and bound algorithm for QOPs where branching operations have been designed to effectively reduce...